Ordinals in Frobenius Monads
نویسندگان
چکیده
This paper provides geometrical descriptions of the Frobenius monad freely generated by a single object. These descriptions are related to results connecting Frobenius algebras and topological quantum field theories. In these descriptions, which are based on coherence results for self-adjunctions (adjunctions where an endofunctor is adjoint to itself), ordinals in ε0 play a prominent role. The paper ends by considering how the notion of Frobenius algebra induces the collapse of the hierarchy of ordinals in ε0, and by raising the question of the exact categorial abstraction of the notion of Frobenius algebra. Mathematics Subject Classification (2000): 03G30, 03E10, 16H05, 16W30, 18C15, 18D10, 55N22
منابع مشابه
Monads and Graphs ∗
The simplicial category ∆ plays many roles all over mathematics. In one of these roles it is a monad freely generated by a single object (see [9], Section 3, [2], Section 4, and references therein). That ∆ is isomorphic to this free monad may be understood as a coherence result connecting the syntax brought by the equational presentation of monads and the semantics given by the order preserving...
متن کاملQf Functors and (co)monads
One reason for the universal interest in Frobenius algebras is that their characterisation can be formulated in arbitrary categories: a functor K : A → B between categories is Frobenius if there exists a functor G : B → A which is at the same time a right and left adjoint of K; a monad F on A is a Frobenius monad provided the forgetful functor AF → A is a Frobenius functor, where AF denotes the...
متن کاملMonads on Dagger Categories
The theory of monads on categories equipped with a dagger (a contravariant identity-on-objects involutive endofunctor) works best when all structure respects the dagger: the monad and adjunctions should preserve the dagger, and the monad and its algebras should satisfy the so-called Frobenius law. Then any monad resolves as an adjunction, with extremal solutions given by the categories of Kleis...
متن کاملReversible monadic computing
We extend categorical semantics of monadic programming to reversible computing, by considering monoidal closed dagger categories: the dagger gives reversibility, whereas closure gives higher-order expressivity. We demonstrate that Frobenius monads model the appropriate notion of coherence between the dagger and closure by reinforcing Cayley’s theorem; by proving that effectful computations (Kle...
متن کاملFrobenius algebras and ambidextrous adjunctions
In this paper we explain the relationship between Frobenius objects in monoidal categories and adjunctions in 2-categories. Specifically, we show that every Frobenius object in a monoidal category M arises from an ambijunction (simultaneous left and right adjoints) in some 2-category D into which M fully and faithfully embeds. Since a 2D topological quantum field theory is equivalent to a commu...
متن کامل